On Hierarchies over the Class of SLUR Formulae
نویسندگان
چکیده
Single look-ahead unit resolution (SLUR) algorithm is a nondeterministic polynomial time algorithm which for a given input formula in a conjunctive normal form (CNF) either outputs its satisfying assignment or gives up. A CNF formula belongs to the SLUR class if no sequence of nondeterministic choices causes the SLUR algorithm to give up on it. The SLUR class is reasonably large. It is known to properly contain the well studied classes of Horn CNFs, renamable Horn CNFs, extended Horn CNFs, and CC-balanced CNFs. Recently, it was shown, that a canonical representation of a Boolean function always belongs to the SLUR class [4, 5]. In this paper we extend this result by showing, that this remains true even for some representations, which are not far from the canonical one. We also generalize the hierarchy of classes of Boolean formulae which was built on top of the SLUR class in [5, 18].
منابع مشابه
On hierarchies over the SLUR class
SLUR is a class of the CNF formulae on which the single lookahead unit resolution algorithm for satisfiability (SAT) testing never fails. It is known that the SLUR class contains classes of Horn, hidden Horn, (hidden) extended Horn and balanced formulae as a subclass. In recent paper it was proven that the SLUR class contains all canonical formulae. In this paper we will extend this result by s...
متن کاملClasses of Boolean Formulae with Effectively Solvable SAT
We present an overview of known classes of Boolean formulae for which polynomial time algorithms for satisfiability testing (SAT) are known. We will summarize basic properties of these classes and their mutual relations with respect to inclusion. One of these classes on which we focus our attention in particular is the class of Single Lookahead Unit Resolution formulae (SLUR). We will define a ...
متن کاملGeneralising and Unifying SLUR and Unit-Refutation Completeness
The class SLUR (Single Lookahead Unit Resolution) was introduced in [22] as an umbrella class for efficient SAT solving. [7,2] extended this class in various ways to hierarchies covering all of CNF (all clause-sets). We introduce a hierarchy SLURk which we argue is the natural “limit” of such approaches. The second source for our investigations is the class UC of unit-refutation complete clause...
متن کاملA modal perspective on monadic second-order alternation hierarchies
We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy over the class of finite directed graphs. This is a response to an open problem posed in [4] and [8]. We also provide modal characterizations of the expressive power of Monadic Second-Order Logic (MSO) and address a number of p...
متن کامل